A DC programming heuristic applied to the logistics network design problem
نویسندگان
چکیده
This paper proposes a new heuristicmethod for the logistics network design and planning problem based on linear relaxation and DC (difference of convex functions) programming. We consider a multi-period, multi-echelon,multi-commodity andmulti-product problemdefined as a large scalemixed integer linear programming (MILP) model. The method is experimented on data sets of various size. The numerical results validate the efficiency of the heuristic for instanceswith up to several dozens facilities, 18 products and 270 retailers. & 2010 Elsevier B.V. All rights reserved.
منابع مشابه
Reliable multi-product multi-vehicle multi-type link logistics network design: A hybrid heuristic algorithm
This paper considers the reliable multi-product multi-vehicle multi-type link logistics network design problem (RMLNDP) with system disruptions, which is concerned with facilities locating, transshipment links constructing, and also allocating them to the customers in order to satisfy their demand on minimum expected total cost (including locating costs, link constructing costs, and also expect...
متن کاملReliable Designing of Capacitated Logistics Network with Multi Configuration Structure under Disruptions: A Hybrid Heuristic Based Sample Average Approximation Algorithm
We consider the reliable multi configuration capacitated logistics network design problem (RMCLNDP) with system disruptions, concerned with facilities locating, transportation links constructing, and also allocating their limited capacities to the customers in order to satisfy their demands with a minimum expected total cost (including locating costs, link constructing costs, as well as expecte...
متن کاملConsidering chain to chain competition in forward and reverse logistics of a dynamic and integrated supply chain network design problem
In this paper, a bi-objective model is presented for dynamic and integrated network design of a new entrant competitive closed-loop supply chain. To consider dynamism and integration in the network design problem, multiple long-term periods are regarded during planning horizon, so that each long-term period includes several short-term periods. Furthermore, a chain to chain competition between t...
متن کاملACO-Based Neighborhoods for Fixed-charge Capacitated Multi-commodity Network Design Problem
The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...
متن کاملA hybrid solution approach for a multi-objective closed-loop logistics network under uncertainty
The design of closed-loop logistics (forward and reverse logistics) has attracted growing attention with the stringent pressures of customer expectations, environmental concerns and economic factors. This paper considers a multi-product, multi-period and multi-objective closed-loop logistics network model with regard to facility expansion as a facility location–allocation problem, which more cl...
متن کامل